A Graph Theoretical Approach to DNA Fragment Assembly
نویسندگان
چکیده
منابع مشابه
DNA Paired Fragment Assembly Using Graph Theory
DNA fragment assembly requirements have generated an important computational problem created by their structure and the volume of data. Therefore, it is important to develop algorithms able to produce high-quality information that use computer resources efficiently. Such an algorithm, using graph theory, is introduced in the present article. We first determine the overlaps between DNA fragments...
متن کاملAn Eulerian path approach to DNA fragment assembly.
For the last 20 years, fragment assembly in DNA sequencing followed the "overlap-layout-consensus" paradigm that is used in all currently available assembly tools. Although this approach proved useful in assembling clones, it faces difficulties in genomic shotgun assembly. We abandon the classical "overlap-layout-consensus" approach in favor of a new euler algorithm that, for the first time, re...
متن کاملAn Online approach to Overlap Detection for DNA Fragment Assembly
We consider the problem of estimating the number of sequences overlapping with a certain length from a large dataset of sequences. Such a problem is central to several challenging bioinformatics applications like DNA fragment assembly. A naive approach of calculating this numberis to perform an all-pairs comparison over the dataset. We propose an entirely different approach to tackle the proble...
متن کاملModified Classical Graph Algorithms for the DNA Fragment Assembly Problem
DNA fragment assembly represents an important challenge to the development of efficient and practical algorithms due to the large number of elements to be assembled. In this study, we present some graph theoretical linear time algorithms to solve the problem. To achieve linear time complexity, a heap with constant time operations was developed, for the special case where the edge weights are in...
متن کاملThe fragment assembly string graph
We present a concept and formalism, the string graph, which represents all that is inferable about a DNA sequence from a collection of shotgun sequencing reads collected from it. We give time and space efficient algorithms for constructing a string graph given the collection of overlaps between the reads and, in particular, present a novel linear expected time algorithm for transitive reduction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Undergraduate Research
سال: 2008
ISSN: 1536-4585,2375-8732
DOI: 10.33697/ajur.2008.008